Nero: A Deterministic Leaderless Consensus Algorithm for DAG-Based Cryptocurrencies
نویسندگان
چکیده
This paper presents the research undertaken with goal of designing a consensus algorithm for cryptocurrencies less latency than current state-of-the-art while maintaining level throughput and scalability sufficient real-world payments. The result is Nero, new deterministic leaderless byzantine in partially synchronous model that especially suited Directed Acyclic Graph (DAG)-based cryptocurrencies. In fact, Nero has communication complexity O(n3) terminates two message delays good case (when there synchrony). shown to be correct, we also show it can provide eventual order. Finally, some performance results are given based on proof concept implementation Rust language.
منابع مشابه
A DAG-based algorithm for distributed mutual exclusion
The paper presents a token based distributed mutual exclusion algorithm. The algorithm assumes a fully connected, reliable physical network and a directed acyclic graph (dag) structured logical network. The number of messages required to provide mutual exclusion is dependent upon the logical topology imposed on the nodes. Using the best topology, the algorithm attains comparable performance to ...
متن کاملDistributed leaderless consensus algorithms for networked Euler-Lagrange systems
This article proposes and analyses distributed, leaderless, model-independent consensus algorithms for networked Euler–Lagrange systems. We propose a fundamental consensus algorithm, a consensus algorithm accounting for actuator saturation, and a consensus algorithm accounting for unavailability of measurements of generalised coordinate derivatives, for systems modelled by Euler–Lagrange equati...
متن کاملAdaptive Leader-Following and Leaderless Consensus of a Class of Nonlinear Systems Using Neural Networks
This paper deals with leader-following and leaderless consensus problems of high-order multi-input/multi-output (MIMO) multi-agent systems with unknown nonlinear dynamics in the presence of uncertain external disturbances. The agents may have different dynamics and communicate together under a directed graph. A distributed adaptive method is designed for both cases. The structures of the contro...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملA Distributed, Leaderless Algorithm for Logical Location Discovery in Specknets
A speck is intended to be a miniature (5x5x5mm) device that combines sensing, processing, wireless communication and energy storage capabilities [1]. A specknet is an ad-hoc mobile wireless network of specks. The logical location of specks in the network is useful, for reasons ranging from routing data to giving the data sensed a spatial context. This paper presents a novel algorithm for discov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2023
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a16010038